Path Auctions When an Agent Can Own Multiple Edges

نویسندگان

  • Ye Du
  • Rahul Sami
  • Yaoyun Shi
چکیده

We study path auction games in which multiple edges may be owned by the same agent in this paper. The edge costs and the set of edges owned by the same agent are privately known to the owner of the edges. In this setting, we show that, assuming that losing agents always have 0 payoff, there is no individual rational, strategyproof mechanism in which only edge costs are reported. If the agents are asked to report costs as well as the identity information, we show that there is no Pareto efficient mechanism that is false-name proof. We then study a first-price path auction in this model. We show that, in the special case of parallel-path graphs, there is always a pure-strategy 2-Nash equilibrium in bids. However, this result does not extend to general graphs: we construct a graph in which there is no such 2-Nash

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Auction Games When an Agent Can Own Multiple Edges

We study path auction games in which multiple edges may be owned by the same agent in this paper. The edge costs and the set of edges owned by the same agent are privately known to the owner of the edge. We show that in this setting, given the assumption the losing agent always has 0 payoff, there is no individual rational strategyproof mechanism in which only edge costs are reported. If the ag...

متن کامل

Path Auctions with Multiple Edge Ownership 1

In this paper, we study path auction games in which multiple edges may be owned by the same agent. The edge costs and the set of edges owned by the same agent are privately known to the owner of the edges. In this setting, we show that, assuming that edges not on the winning path always get 0 payment, there is no individually rational, strategyproof mechanism in which only edge costs are report...

متن کامل

No truthful mechanism can be better than n approximate for two natural problems

This work gives the first natural non-utilitarian problems for which the trivial n approximation via VCG mechanisms is the best possible. That is, no truthful mechanism can be better than n approximate, where n is the number of agents. The problems are the min-max variant of shortest path and (directed) minimum spanning tree mechanism design problems. In these procurement auctions, agents own t...

متن کامل

Accounting for Cognitive Costs in On - lineAuction

Many auction mechanisms, including rst and second price ascending and sealed bid auctions, have been proposed and analyzed in the economics literature. We compare the usefulness of diierent mechanisms for on-line auctions, focusing on the cognitive costs placed on users (e.g. the cost of determining the value of a good), the possibilities for agent mediation, and the trust properties of the auc...

متن کامل

Cost and Trust Issues in On-Line Auctions

Many auction mechanisms, including rst and second-price ascending and sealed-bid auctions, have been proposed and analyzed in the economics literature. We compare the usefulness of di erent mechanisms for on-line auctions, focusing on the di erent costs of determining reservation prices, determining bids and communicating bids, and on whether the auctioneer is trusted. Di erent auction formats ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007